#include "../lib/graph.hpp"
#include "../lib/fcp.hpp"
#include "../lib/plandwriter.hpp"
#include <iostream>

using namespace std;

void itterate(Node* n)
{
    cout << n->name_  << n->property("pinned") << endl;

    if(n->name_ == "Sink")
        cout << "Found End" << endl;
    else
    {
        for(int i = 0; i < n->childeren_.size(); i++)
            itterate(n->childeren_[i]);
    }
}


int main()
{
    Graph g;
    g.importGraph("workflow.xml");
    FCP::doFCP(g);
    g.exportGraph("out.xml");
    vector<string> hosts;
    hosts.push_back("192.168.1.10");
    hosts.push_back("192.168.1.11");
    hosts.push_back("192.168.1.12");
    hosts.push_back("192.168.1.13");
    hosts.push_back("192.168.1.14");
    PlandWriter::ExportPland(hosts, g,"output");
    return 0;
}
